Associative Memories with Small World Connectivity

نویسندگان

  • Neil Davey
  • Lee Calcraft
  • Bruce Christianson
  • Rod Adams
چکیده

In this paper we report experiments designed to find the relationship between the different parameters of sparsely connected networks of perceptrons with small world connectivity patterns, acting as associative memories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Capacity, Small World Associative Memory Models NEIL DAVEY, LEE CALCRAFT and ROD ADAMS

Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symmetric connectivity. Here we investigate sparse networks of threshold units, trained with the perceptron learning rule. The units are given position and are arranged in a ring. The connectivity graph varies between bein...

متن کامل

Locally-Connected and Small-World Associative Memories in Large Networks

The performance of a locally-connected associative memories built from a onedimensional array of perceptrons with a fixed number of afferent connections per unit is investigated under conditions of increasing network size. The performance profile yields unexpected results, with a peak in performance when the network size is 2 to 3 times the number of connections per unit. This phenomenon is dis...

متن کامل

Connectivity in Real and Simulated Associative Memories

Finding efficient patterns of connectivity in sparse associative memories is a difficult problem. It is, however, one that real neuronal networks, such as the mammalian cortex, must have solved. We have investigated computational models of sparsely connected associative memories and found that some patterns of connectivity produce both good performance and efficient use of resources. This could...

متن کامل

Gaussian and exponential architectures in small-world associative memories

The performance of sparsely-connected associative memory models built from a set of perceptrons is investigated using different patterns of connectivity. Architectures based on Gaussian and exponential distributions are compared to networks created by progressively rewiring a locally-connected network. It is found that while all three architectures are capable of good pattern-completion perform...

متن کامل

Connectivity in Real and Evolved Associative Memories

Finding efficient patterns of connectivity in sparse associative memories is a difficult problem. It is, however, one that real neuronal networks, such as the mammalian cortex, must have solved. We have investigated evolved computational models of sparsely connected associative memories and found that some patterns of connectivity produce both good performance and efficient use of resources. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004